postfix expression造句
例句与造句
- converting infix expression to a postfix expression
中缀表达式到后缀表达式的转换 - read the postfix expression from left to right
从左到右读入后缀表达式 - you can use the following algorithm to evaluate postfix expressions
您可以用如下算法对后缀表达式求值: - at the end of the postfix expression, pop a result from the stack
到后缀表达式末尾,从堆栈中弹出结果。 - evaluating the postfix expression
对后缀表达式求值 - It's difficult to find postfix expression in a sentence. 用postfix expression造句挺难的
- if the postfix expression was correctly formed, the stack should be empty
若后缀表达式格式正确,那么堆栈应该为空。 - evaluating a postfix expression is simpler than directly evaluating an infix expression
对后缀表达式求值比直接对中缀表达式求值简单。 - if you could not pop two operators, the syntax of the postfix expression was not correct
如果您不能够弹出两个操作数,后缀表达式的语法就不正确。